Group Movement Pattern Mining Algorithm for Data Compression

نویسندگان

  • Prabha
  • V.SathyaBama
چکیده

To reduce the data volume, various algorithms have been proposed for data compression and data aggregation. In object tracking applications, natural phenomena show that many creatures form large social groups and move in regular patterns. However, the previous works do not address application level semantics, such as the group relationships and movement patterns, in the location data. In this paper, we first introduce an efficient distributed mining algorithm to approach the moving object clustering problem and discover group movement patterns. Afterward, we propose a novel compression algorithm, based on the discovered group movement patterns to overcome the group data compression problem. Our experimental results show that the proposed compression algorithm effectively and efficiently reduces the amount of delivered data and reduces energy consumption expense for data transmission in WSNs. Keywords--Data compression, data aggregation, distributed mining, object tracking ,energy consumption.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Discovering Data Storage by Task Scheduling and Network Construction for Data Compression in Global Position System

Natural trend show number of animals forms large social groups and move in regular patterns. We formulate a moving object clustering problem that jointly identifies a group of objects and discovers their movement patterns. Data storage and transmission, task scheduling, and network construction used for that. We have proposed a clustering algorithm to find the group relationships for query and ...

متن کامل

A Pattern Recognition Approach To Secure Cipher Documents

Natural phenomena show that many creatures form large social groups and move in regular patterns. Previous In this paper, we first propose an efficient distributed mining algorithm to jointly identify a group of moving objects and discover their movement patterns in wireless sensor networks. Afterward, we propose a compression algorithm, called 2P2D, which exploits the obtained group movement p...

متن کامل

An Improved SSPCO Optimization Algorithm for Solve of the Clustering Problem

Swarm Intelligence (SI) is an innovative artificial intelligence technique for solving complex optimization problems. Data clustering is the process of grouping data into a number of clusters. The goal of data clustering is to make the data in the same cluster share a high degree of similarity while being very dissimilar to data from other clusters. Clustering algorithms have been applied to a ...

متن کامل

An Improved SSPCO Optimization Algorithm for Solve of the Clustering Problem

Swarm Intelligence (SI) is an innovative artificial intelligence technique for solving complex optimization problems. Data clustering is the process of grouping data into a number of clusters. The goal of data clustering is to make the data in the same cluster share a high degree of similarity while being very dissimilar to data from other clusters. Clustering algorithms have been applied to a ...

متن کامل

Efficient mining of group patterns from user movement data

In this paper, we present a new approach to derive groupings of mobile users based on their movement data. We assume that the user movement data are collected by logging location data emitted from mobile devices tracking users. We formally define group pattern as a group of users that are within a distance threshold from one another for at least a minimum duration. To mine group patterns, we fi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012